3-Move Undeniable Signature Scheme
نویسندگان
چکیده
In undeniable signature schemes, zero-knowledgeness and non-transferability have been identified so far. In this paper, by separating these two notions, we show the first 3-move confirmation and disavowal protocols for Chaum’s undeniable signature scheme which is secure against active and concurrent attacks. Our main observation is that while the signer has one public key and one secret key, there exist two witnesses in the confirmation and disavowal proofs of Chaum’s
منابع مشابه
Short 2-Move Undeniable Signatures
Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication constraints. In this paper, we offer a solution to this problem in the context of undeniable signatures with interactive verification protocols by...
متن کاملThreshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almost all the existed schemes are based on discrete logarithm cryptosystems. In this paper, based on an improvement of the practical threshold RSA signature scheme proposed by Shoup at Eurocrypt’2000 and the first undenia...
متن کاملIsogeny-Based Quantum-Resistant Undeniable Signatures
We propose an undeniable signature scheme based on elliptic curve isogenies, and prove its security under certain reasonable number-theoretic computational assumptions for which no efficient quantum algorithms are known. Our proposal represents only the second known quantum-resistant undeniable signature scheme, and the first such scheme secure under a number-theoretic complexity assumption.
متن کاملAnonymity and Denial of Undeniable and Confirmer Signatures
We introduce a new security property for undeniable and con rmer signatures in the multi-user setting, namely, anonymity. We show that many existing systems do not have this property.We modify the original undeniable signature scheme of Chaum and van Antwerpen and the RSA-based undeniable/con rmer signature scheme of Gennaro, Krawczyk and Rabin so that they achieve anonymity. We also provide a ...
متن کاملConvertible Undeniable Signatures
We introduce a new concept called convertible undeniable signature schemes. In these schemes, release of a single bit string by the signer turns all of his signatures, which were originally undeniable signatures, into ordinary digital signatures. We prove that the existence of such schemes is implied by the existence of digital signature schemes. Then, looking at the problem more practically, w...
متن کامل